Semantics-Based Resolution of Fragments and Underspecified Structures
نویسندگان
چکیده
This article presents algorithms for the interpretation of subsentential and underspecified structures in English within the theory of Ontological Semantics. The approach centers around producing a text-meaning representation of the subsentential or underspecified structure, then launching a procedural semantic routine to appropriately link its meaning to that of the previous context. The algorithms to be described are being implemented in the OntoSem text processing environment.
منابع مشابه
Processing Underspecified Semantic Representations in the Constraint Language for Lambda Structures
The constraint language for lambda structures (CLLS) is an expressive language of tree descriptions which combines dominance constraints with powerful parallelism and binding constraints. CLLS was introduced as a uniform framework for defining underspecified semantics representations of natural language sentences, covering scope, ellipsis, and anaphora. This article presents saturation-based al...
متن کاملFlexible Disambiguation and Expressive Completeness in Dependency Tree Semantics
This paper proposes an extension of Dependency Tree Semantics (DTS), an underspecified formalism originally proposed in Robaldo (2007). The crucial advantage of DTS as compared to other contemporary proposals is its ability to represent Independent Set (IS) readings (a.k.a. scopeless readings), e.g. cumulative and collective readings. DTS achieves the expressivity needed to represent IS reading...
متن کاملToward a Universal Underspecified Semantic Representation
We define Canonical Form Minimal Recursion Semantics (CF-MRS) and prove that all the well-formed MRS structures generated by the MRS semantic composition algorithm are in this form. We prove that the qeq relationships are equivalent to outscoping relations when MRS structures are in this form. This result fills the gap between some underspecification formalisms and motivates defining a Canonica...
متن کاملAn Efficient Enumeration Algorithm for Canonical Form Underspecified Semantic Representations
We give polynomial-time algorithms for satisfiability and enumeration of underspecified semantic representations in a canonical form. This canonical form brings several underspecification formalisms together into a uniform framework (Manshadi et al., 2008), so the algorithms can be applied to any underspecified representation that can be converted to this form. In particular, our algorithm can ...
متن کاملSemantic Underspecification : Which Technique for What
In recent years a variety of representation formalisms have been proposed that support the construction of underspecified semantic representations, such as Quasi-Logical Form, Underspecified Logical Form, Underspecified Discourse Representation Theory, Minimal Recursion Semantics, Ontological Promiscuity, Hole Semantics, the Constraint Language for Lambda Structures, and Normal Dominance Constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015